Load Balancing in Hop - by - Hop Routing with and without Traffic Splitting

نویسنده

  • JUN WANG
چکیده

This dissertation presents an exploration on solving traffic load balancing problems concentrating on the IP layer in hop-by-hop networks. The first part of the traffic load balancing research is focused on bandwidth-sensitive routing for premium class traffic in Differentiated Service (DiffServ) networks, where bandwidth usage of the premium class traffic is critical not only for the traffic itself, but also for other classes of traffic with lower priorities in the same network, such as the assured or best effort traffic. If the traffic in a network is splittable, then the second part of the load balancing research is intra-domain traffic engineering in the network, where the bandwidthsensitive routing solutions in the first part can be used to achieve better traffic load balancing results in this part. Hop-by-hop routing is the base routing paradigm in today’s Internet. It is routing-table-driven and destination-address-based. This means, firstly, each node (router) in such a network constructs its routing table independently using its own topology information about the entire network; secondly, each node looks up the next hops in its routing table for incoming packets based on their destination addresses. No flow information or source address information is used while forwarding. Therefore, an important issue in a hop-by-hop network is the avoidance of forwarding loops. Since each node makes routing decisions independently, the used routing algorithm should be consistent so that the forwarding loop-freedom is ensured. Most of existing routing schemes are based on the Dijkstra’s algorithm, by applying different weight functions. In the first part of this dissertation, a fundamental relation between weight functions and the routing consistency of Dijkstra-based algorithms is explored theoretically, and this forms the basis for the rest of this dissertation. Quality of Service (QoS) provision is one of the key issues for today’s Internet Service Providers

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Load-Balanced Route Discovery for Mobile Ad hoc Networks

This paper presents Flow-Aware Routing Protocol (FARP), a new routing strategy designed to improve load balancing and scalability in mobile ad hoc networks. FARP is a hop-by-hop routing protocol, which introduces a flow-aware route discovery strategy to reduce the number of control overheads propagating through the network and distributes the flow of data through least congested nodes to balanc...

متن کامل

QoS-Aware Routing Schemes Based on Hierarchical Load-Balancing for Integrated Services Packet Networks

This paper presents a load balancing method to improve network utilization when static routing algorithms are employed. Static routing algorithms can generally be reduced to a path assignment problem with the aim of minimizing a cost function: i.e., maximizing network revenues. Unfortunately the problem, when multiple constraints such as different QoS traffic classes are present, is computation...

متن کامل

Load-aware and Position-aided Routing in Satellite IP Networks

Satellite communication is regarded as a promising way to achieve seamless global coverage with an array of advantages over the traditional terrestrial network. However, the non-uniform distribution of users and the highly topological dynamics have been a matter of facts. The traditional load balancing technique is able to guarantee a better traffic distribution around the Inter Satellite Links...

متن کامل

Fine grained load balancing in multi-hop wireless networks

In this paper we address the problem of local balancing in multi-hop wireless networks. We introduce the notion of proactive routing: after a short pre-processing phase in which nodes build their routing tables by exchanging messages with neighbors, we require that nodes decide the relay of each message without any further interaction with other nodes. Besides delivering very low communication ...

متن کامل

To Minimize Interference in Multi Hop Wireless Mesh Networks Using Load Balancing Interference Aware Protocol

In recent years, wireless mesh networks have become more popular than ever. They are now called as last mile internet connectivity. WMN has the advantage of robust fault tolerance. Even if some of the mesh nodes are incapable, there exist many other alternative nodes to serve relay. In addition, multi-hop of WMN can not only spread coverage but also save both cabling cost and human resource. A ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003